Backward Reasoning in Aboxes for Query Answering
نویسنده
چکیده
In this paper, we address the problem of answering (unions of) conjunctive queries on Aboxes. We propose a backward-chaining query evaluation based on query expansion. Expanding a query consists of determining all the ways of deriving it from atoms built on some distinguished predicates.
منابع مشابه
Towards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملGoal-oriented Type-based Reasoning for Expressive DLs
Reasoning in expressive Description Logics (DLs) that contain ALC is challenging, partly because they do not enjoy the useful universal model property of their Horn counterparts. There are efficient state-of-the-art reasoners for standard reasoning tasks, but they are still lacking for other tasks that do not reduce easily to satisfiability. For instance, for query answering, there are a few al...
متن کاملConjunctive Query Answering in Distributed Ontology Systems for Ontologies with Large OWL ABoxes
We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed over a set of autonomous nodes. We focus on ontologies with large ABoxes. The query processing procedure determines and retrieves the facts that are relevant to answering a given query from other nodes, then construc...
متن کاملReducing SHIQ-Description Logic to Disjunctive Datalog Programs
As applications of description logics proliferate, efficient reasoning with large ABoxes (sets of individuals with descriptions) becomes ever more important. Motivated by the prospects of reusing optimization techniques from deductive databases, in this paper, we present a novel approach to checking consistency of ABoxes, instance checking and query answering, w.r.t. ontologies formulated using...
متن کاملAnswering Conjunctive Queries over a Temporally-Ordered Finite Sequence of ABoxes sharing one TBox
Ontology-based data access (OBDA) assumes that data in a database are mediated with a conceptual layer, available for clients and hiding data storage details. Ontologies are good candidates for such a conceptual layer presentation, whereas databases are good for huge data storage. One of the interesting applications of OBDA is checking a finite set of constraints defined in some language agains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999